124 research outputs found

    Associated Polynomials and Uniform Methods for the Solution of Linear Problems

    Get PDF
    To every polynomial P of degree n we associate a sequence of n-1 polynomials of increasing degree which we call the associated polynomials of P. The associated polynomials depend in a particularly simple way on the coefficients of P. These polynomials have appeared in many guises in the literature, usually related to some particular application and most often going unrecognized. They have been called Horner polynomials and Laguerre polynomials. Often what occurs is not an associated polynomial itself but a number which is an associated polynomial evaluated at a zero of P. The properties of associated polynomials have never been investigated in themselves. We shall try to demonstrate that associated polynomials provide a useful unifying concept. Although many of the results of this paper are new, we shall also present known results in our framework

    Computational Complexity of Iterative Processes

    Get PDF
    The theory of optimal algorithmic processes is part of computational complexity. This paper deals with analytic computational complexity. The relation between the goodness of an iteration algorithm and its new function evaluation and memory requirements are analyzed. A new conjecture is stated

    09391 Abstracts Collection -- Algorithms and Complexity for Continuous Problems

    Get PDF
    From 20.09.09 to 25.09.09, the Dagstuhl Seminar 09391 Algorithms and Complexity for Continuous Problems was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available
    • …
    corecore